Transition phenomena for the attractor of an iterated function system*
نویسندگان
چکیده
Iterated function systems (IFSs) and their attractors have been central to the theory of fractal geometry almost from its inception. And contractivity functions in IFS has iterated systems. If are contractions, then is guaranteed a unique attractor. Recently, however, there an interest what occurs attractor at boundary between contractvity expansion IFS. That subject this paper. For family $F_t$ IFSs depending on real parameter $t>0$, existence properties two types transition attractors, called lower $A_{\bullet}$ upper $A^{\bullet}$, investigated. A main theorem states that, for wide class families, threshold $t_0$ such that $A_t$ $tt_0$. At $t_0$, $F_{t_0}$-invariant set $A^{\bullet}$ $A^{\bullet} = \lim_{t\rightarrow t_0} A_t$.
منابع مشابه
Spatial Bounding of Self-Affine Iterated Function System Attractor Sets
An algorithm is presented which, given the parameters of an Iterated Function System (IFS) which uses affine maps, constructs a closed ball which completely contains the attractor set of the IFS. These bounding balls are almost always smaller than those computed by existing methods, and are sometimes much smaller. The algorithm is numerical in form, involving the optimisation of centre-point an...
متن کاملChaotic property for non-autonomous iterated function system
In this paper, the new concept of non-autonomous iterated function system is introduced and also shown that non-autonomous iterated function system IFS(f_(1,∞)^0,f_(1,∞)^1) is topologically transitive for the metric space of X whenever the system has average shadowing property and its minimal points on X are dense. Moreover, such a system is topologically transitive, whenever, there is a point ...
متن کاملApproximation of the attractor of a countable iterated function system 1 Nicolae - Adrian Secelean
In this paper we will describe a construction of a sequence of sets which is converging, with respect to the Hausdorff metric, to the attractor of a countable iterated function system on a compact metric space. The importance of that method consists in the fact that the approximation sequence can be constructed of finite sets, hence it is very useful for computer graphic representation. 2000 Ma...
متن کاملAttractor image coding using lapped partitioned iterated function systems
The usual attractor coding technique is to partition a given image into a number of non-overlapping range blocks. Each block of the partition is expressed as the contractive transformation of another part of the image. However, the non-overlapping partitioning induces blocking artifacts which is highly disturbing to human visual system. In this work, a novel coding scheme using iterated functio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Nonlinearity
سال: 2022
ISSN: ['0951-7715', '1361-6544']
DOI: https://doi.org/10.1088/1361-6544/ac8af1